Shortest Path Multicast Tree Construction Algorithm to Transmit Multimedia Real Time Traffic in MANETS

نویسنده

  • Sapna B Kulkarni
چکیده

Mobile ad hoc network is a self-configuring, self organizing and decentralized network. It is connected by wireless links. Each device in a MANET is free to move independently in any direction. Hence it can change its links to other devices frequently. It is a collection of mobile wireless nodes that can dynamically form a network without using any pre-existing infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. Because of connectivity richness in mobile ad hoc networks, there often exist multiple paths between a source and a destination. Since many applications require uninterrupted connectivity of a session, the ability to find long-living paths can be very useful. However, MANETs does not seem to effectively support live video transmission and multimedia applications. The main objective of our work is to improve the performance. . In mobile ad hoc networks (MANET), during real time traffic multicasting, there is increased energy consumption and delay. Hence in mobile ad hoc network (MANET) cluster head selection is considered a gigantic challenge. An efficient ENB cluster head selection algorithm [1] based on the combination of important matrices Residual Energy (E), Node connectivity (C) and Available Bandwidth (B) is used for selection of the cluster head efficiently in Mobile ad hoc networks. The multimedia traffic stream is split into multiple sub-streams prior to transmission using Top-N rule selection approach algorithm [2]. In this paper we are proposing a shortest path multicast tree construction algorithm to transmit the real time traffic effectively among the nodes in MANETS. Using the cluster head as group leaders and cluster members as leaf nodes, a shortest path multicast tree is established. This helps in transmitting multimedia real time traffic to different receivers. This algorithm works very well in Energy and Bandwidth Aware Clustering Algorithm for Real-time Traffic Multicasting in Mobile Ad Hoc Networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Delay-Constrained Shortest Path Algorithm for Multicast Routing in Multimedia Applications

A new heuristic algorithm is proposed for constructing multicast tree for multimedia and real-time applications. The tree is used to concurrently transmit packets from source to multiple destinations such that exactly one copy of any packet traverses the links of the multicast tree. Since multimedia applications require some Quality of Service, QoS, a multicast tree is needed to satisfy two mai...

متن کامل

A Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks

Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...

متن کامل

An Efficient Algorithm for Shortest Path Multicast Routing under Delay and Delay Variation Constraints

A new heuristic algorithm is proposed for constructing multicast tree for multimedia and interactive applications that require certain quality of services, QoS. We consider two main QoS parameters that are the delay and delay variation. The problem is formulated as constructing shortest path tree under delay and delay variation constraints. The tree is used to concurrently transmit packets from...

متن کامل

An Efficient Algorithm for Delay Delay-variation Bounded Least Cost Multicast Routing

Many multimedia communication applications require a source to transmit messages to multiple destinations subject to quality of service (QoS) delay constraint. To support delay constrained multicast communications, computer networks need to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. This is known as multicast delay problem. On the other hand...

متن کامل

Genetic Algorithms for Dynamic Routing Problems in Mobile Ad Hoc Networks

Routing plays an important role in various types of networks. There are two main ways to route the packets, i.e., unicast and multicast. In most cases, the unicast routing problem is to find the shortest path between two nodes in the network and the multicast routing problem is to find an optimal tree spanning the source and all the destinations. In recent years, both the shortest path routing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015